A Summary and Comparison of MOEA Algorithms
نویسنده
چکیده
The following MOEA algorithms are briefly summarized and compared: • NPGA Niched Pareto Genetic Algorithm (1994) – NPGA II (2001) • NSGA Non-dominated Sorting Genetic Algorithm (1994) – NSGA II (2000) • SPEA Strength Pareto Evolutionary Algorithm (1998) – SPEA2 (2001) – SPEA2+ (2004) – ISPEA Immunity SPEA (2003) • PAES Pareto Archived Evolution Strategy (2000) – M-PAES Mimetic PAES (2000) • PESA Pareto Envelope-based Selection Algorithm (2000) – PESA II (2001) • Micro-GA Micro-Genetic Algorithm (2001) – Micro-GA2 (2003) • MPGA Multi-Population Genetic Algorithm (2003) • CAEP Cultural Algorithm with Evolutionary Programming (2003) • MOPSO Multi-Objective Particle Swarm Optimization (2003) • ParEGO Pareto Efficient Global Optimization (2005)
منابع مشابه
A Hybrid MOEA/D-TS for Solving Multi-Objective Problems
In many real-world applications, various optimization problems with conflicting objectives are very common. In this paper we employ Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D), a newly developed method, beside Tabu Search (TS) accompaniment to achieve a new manner for solving multi-objective optimization problems (MOPs) with two or three conflicting objectives. This i...
متن کاملFacility Location and Inventory Balancing in a Multi-period Multi-echelon Multi-objective Supply Chain: An MOEA Approach
A comprehensive and integrated study of any supply chain (SC) environment is a vital requirement that can create various advantages for the SC owners. This consideration causes productive managing of the SC through its whole wide components from upstream suppliers to downstream retailers and customers. On this issue, despite many valuable studies reported in the current literature, considerabl...
متن کاملComparison between MOEA/D and NSGA-II on the Multiobjective Travelling Salesman Problem
Most multiobjective evolutionary algorithms are based on Pareto dominance for measuring the quality of solutions during their search, among them NSGA-II is well-known. A very few algorithms are based on decomposition and implicitly or explicitly try to optimize aggregations of the objectives. MOEA/D is a very recent such an algorithm. One of the major advantages of MOEA/D is that it is very eas...
متن کاملVisualization Technique for Analyzing Non-dominated Set Comparison
Multi-objective evolutionary algorithms (MOEAs) have been proved successfully in many different applications. Over 900 publications [4] have since proposed various MOEA implementations and applications. However, there is still a significant lack of studies on metrics for MOEA comparison. In this paper, we propose a new visualization technique that will provide better analysis of the nondominate...
متن کاملMultiobjective Evolutionary Algorithms: Analyzing the State-of-the-Art
Solving optimization problems with multiple (often conflicting) objectives is, generally, a very difficult goal. Evolutionary algorithms (EAs) were initially extended and applied during the mid-eighties in an attempt to stochastically solve problems of this generic class. During the past decade, a variety, of multiobjective EA (MOEA) techniques have been proposed and applied to many scientific ...
متن کامل